Tree lifting orderings for termination transformations of term rewriting systems
نویسندگان
چکیده
A technique to prove the termination of a given term rewriting system (TRS, for short) is presented. We propose tree lifting orderings by which from a given TRS R candidates for the termination of R can be obtained|the termination of (at least) one of these candidates guarantees the termination ofR. It should be remarked that for a given nite TRS all its candidates can be computed automatically. Our technique is a generalization of the dummy elimination transformation by Ferreira and Zantema (1995) and extends a modularity result on the termination of the direct sum of TRSs by Middeldorp (1989).
منابع مشابه
Termination of term rewriting using dependency pairs
We present techniques to prove termination and innermost termination of term rewriting systems automatically. In contrast to previous approaches, we do not compare left-and right-hand sides of rewrite rules, but introduce the notion of dependency pairs to compare left-hand sides with special subterms of the right-hand sides. This results in a technique which allows to apply existing methods for...
متن کاملmu-term: A Tool for Proving Termination of Context-Sensitive Rewriting
Restrictions of rewriting can eventually achieve termination by pruning all infinite rewrite sequences issued from every term. Contextsensitive rewriting (CSR) is an example of such a restriction. In CSR, the replacements in some arguments of the function symbols are permanently forbidden. This paper describes mu-term, a tool which can be used to automatically prove termination of CSR. The tool...
متن کاملTermination Analysis for Functional Programs using Term Orderings
To prove the termination of a functional program there has to be a well-founded ordering such that the arguments in each recursive call are smaller than the corresponding inputs. In this paper we present a procedure for automated termination proofs of functional programs. In contrast to previously presented methods a suited well-founded ordering does not have to be xed in advance by the user, b...
متن کاملAutomatically Proving Termination Where Simpli cation Orderings Fail
To prove termination of term rewriting systems (TRSs), several methods have been developed to synthesize suitable well-founded orderings automatically. However, virtually all orderings that are amenable to automation are so-called simpli cation orderings. Unfortunately, there exist numerous interesting and relevant TRSs that cannot be oriented by orderings of this restricted class and therefore...
متن کاملRelating Innermost, Weak, Uniform and Modular Termination of Term Rewriting Systems
Term rewriting systems play an important role in various areas, e.g. in abstract data type speciications, for automated theorem proving and as a basic computation model for functional programming languages. In theory and practice, one of the most important properties of term rewriting systems is the strong normalization or ((nite or uniform) termination property which is undecidable in general....
متن کامل